All Questions
2 questions
-2votes
3answers
810views
Link to ISO doc? Complexity of unordered_map operations in C++::stl [closed]
In different forums, I have found the statement that in C++::stl, insert and find for unordered_map have guaranteed amortized time complexity O(1). This puzzles me, and I would like to see the ...
2votes
4answers
8kviews
What sorting algorithm does STL use?
I recently started using <vector.h> library and I was wondering, since all the operations are already implemented, IF the method of the sorting algorithm is the most efficient one. Everything ...